A scheme for the synchronization of variable length codes
نویسندگان
چکیده
منابع مشابه
Error states and synchronization recovery for variable length codes
The Synchronization Variable length codes. The Construction of Variable length codes with good Synchronization Properties. On the Expected codeword Length per Symbol of optimal prefix codes for extended Sources.
متن کاملAdditive Variable Length Codes for the Integers
This paper introduces a new family of variable length codes for the integers, initially based on the Goldbach conjecture that every even integer is the sum of two primes. For an even integer we decompose the value into its two constituent primes and encode the ordinal numbers of those primes with an Elias gamma code. The method is then elaborated to handle odd integers. The paper then develops ...
متن کاملA Study of Variable Length Error Correcting Codes and Reversible Variable Length Codes: Analysis and Applications
is an authentic record of my work carried out under the supervision of Prof. N. Kalyanasundaram and Prof. Bhudev Sharma. I have not submitted this work elsewhere for any other degree or diploma. I am fully responsible for the contents of my Ph.D. Thesis. is a bonafide record of her original work carried out under our supervision. This work has not been submitted elsewhere for any other degree o...
متن کاملJoint Utilization of Fixed and Variable-Length Codes for Improving Synchronization Immunity for Image Transmission
Robust transmission of images is achieved by using xed and variable-length coding together without much loss in compression e ciency. The probability distribution function of a DCT coe cient can be divided into two regions using a threshold, so that one portion contains roughly equiprobable transform coefcients. While xed-length coding, which is a powerful solution to the synchronization proble...
متن کاملVariable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00196-1